package leetcode.t1Array;


/**
 * @author K
 * @date 2024/1/17 13:41
 */
public class T0_ArraySolution {

    public static void nextPermutation(int[] nums) {
        int i = nums.length-2;
        while (i > 0 && nums[i] < nums[i-1]) i--;

    }

    public static void main(String[] args) {


        System.out.println();
    }

}
